separable-kernel decomposition method for pproximating the DSR continuation operator
نویسندگان
چکیده
We develop a separable-kernel decomposition method for approximating the double-square-root DSR continuation operator in one-way migrations in this paper. This new approach is a further development of separable approximations of the single-square-root SSR operator. The separable approximation of the DSR operator generally involves solving a complicated nonlinear system of integral equations. Instead of solving this nonlinear system directly, our new method consists of repeatedly applying the separable-kernel technique developed for the two-variable SSR operator to the multivariable DSR operator. Numerical experiments demonstrate the efficiency of the proposed method. We illustrate the fast convergence of the obtained separable approximation. We also demonstrate the capability of this novel approximation for imaging an area with geologic complexities through synthetic data.
منابع مشابه
Nano- TiO2/Nd Deposited on -Fe2O3 as a Magnetically Separable Photocatalyst
TiO2/Magnetit and TiO2/Nd/Magnetit were prepared and used for photocatalytic decomposition of the methylorange as a pollutant. TiO2 and TiO2/Nd were prepared by sol gel method and were characterized using XRD, FT IR and TEM. The prepared catalysts were deposited on magnetite surface to have a catalyst with magnetite core. So the catalyst can be separated easily from the waste solution by a magn...
متن کاملA Note on the Heat Kernel on the Heisenberg Group
Let ps be the convolution kernel of the operator e −sL (see [5, (1.10), (1.11)]). When s > 0, e−sL is the solution operator for the Heisenberg heat equation ∂su = −Lu and ps is called the heat kernel (see [6, (7.30), p. 71]. The goal of this note is to study the analytic continuation of the heat kernel ps. This is interesting from the point of view of the theory of analytic hypoellipticity (see...
متن کاملUSING FRAMES OF SUBSPACES IN GALERKIN AND RICHARDSON METHODS FOR SOLVING OPERATOR EQUATIONS
In this paper, two iterative methods are constructed to solve the operator equation $ Lu=f $ where $L:Hrightarrow H $ is a bounded, invertible and self-adjoint linear operator on a separable Hilbert space $ H $. By using the concept of frames of subspaces, which is a generalization of frame theory, we design some algorithms based on Galerkin and Richardson methods, and then we in...
متن کاملAnisotropic Multidimensional Savitzky Golay kernels for Smoothing, Differentiation and Reconstruction
The archetypal Savitzky–Golay convolutional filter matches a polynomial to even-spaced data and uses this to measure smoothed derivatives. We synthesize a scheme in which heterogeneous, anisotropic linearly separable basis functions combine to provide a general smoothing, derivative measurement and reconsruction function for point coulds in multiple dimensions using a linear operator in the for...
متن کاملGabor feature-based apple quality inspection using kernel principal component analysis
Automated inspection of apple quality involves computer recognition of good apples and blemished apples based on geometric or statistical features derived from apple images. This paper introduces a Gabor feature-based kernel principal component analysis (PCA) method by combining Gabor wavelet representation of apple images and the kernel PCA method for apple quality inspection using near-infrar...
متن کامل